int* twoSum(int* nums, int numsSize, int target, int* returnSize)
{
  int* result = (int *)malloc(sizeof(int) * 2);

  for (int i = 0; i < numsSize - 1; i++) // 1层循环 i: 0 ==> N-1
  {
    for (int j = i + 1; j < numsSize; j++) // 2 层循环 j: i+1 ==> N-1
    {
      if (nums[i] + nums[j] == target) // arr[i] + arr[j] 是否等于 target
      {
        result[0] = i;
        result[1] = j;
        *returnSize = 2;

        return result;
      }
    }
  }

  return result;
}
